Imprimitive symmetric graphs with cyclic blocks
نویسندگان
چکیده
Let Γ be a graph admitting an arc-transitive subgroup G of automorphisms that leaves invariant a vertex partition B with parts of size v ≥ 3. In this paper we study such graphs where: for B, C ∈ B connected by some edge of Γ , exactly two vertices of B lie on no edge with a vertex of C; and as C runs over all parts of B connected to B these vertex pairs (ignoring multiplicities) form a cycle. We prove that this occurs if and only if v = 3 or 4, and moreoverwe give three geometric or group theoretic constructions of infinite families of such graphs. © 2009 Elsevier Ltd. All rights reserved.
منابع مشابه
Solution to a Question on a Family of Imprimitive Symmetric Graphs
We answer a recent question posed by Li et al. [‘Imprimitive symmetric graphs with cyclic blocks’, European J. Combin. 31 (2010), 362–367] regarding a family of imprimitive symmetric graphs. 2000 Mathematics subject classification: primary 05C25; secondary 05E99.
متن کاملFinite symmetric graphs with two-arc transitive quotients
This paper forms part of a study of 2-arc transitivity for finite imprimitive symmetric graphs, namely for graphs admitting an automorphism groupG that is transitive on ordered pairs of adjacent vertices, and leaves invariant a nontrivial vertex partition B. Such a group G is also transitive on the ordered pairs of adjacent vertices of the quotient graph B corresponding toB. If in additionG is ...
متن کاملImprimitive Symmetric Graphs
A finite graph Γ is said to be G-symmetric if G is a group of automorphisms of Γ acting transitively on the ordered pairs of adjacent vertices of Γ. In most cases, the group G acts imprimitively on the vertices of Γ, that is, the vertex set of Γ admits a nontrivial G-invariant partition B. The purpose of this thesis is to study such graphs, called imprimitive G-symmetric graphs. In the first pa...
متن کاملImprimitive flag-transitive symmetric designs
A recent paper of O’Reilly Regueiro obtained an explicit upper bound on the number of points of a flagtransitive, point-imprimitive, symmetric design in terms of the number of blocks containing two points. We improve that upper bound and give a complete list of feasible parameter sequences for such designs for which two points lie in at most ten blocks. Classifications are available for some of...
متن کاملA Geometrical Approach to Imprimitive Graphs
We establish a geometrical framework for the study of imprimitive, G-symmetric graphs F by exploiting the fact that any G-partition B of the vertex set VT gives rise both to a quotient graph fB and to a tactical configuration D(B) induced on each block B e B . We also examine those cases in which D(B) is degenerate, and characterize the possible graphs f in many cases where the quotient FB is e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 31 شماره
صفحات -
تاریخ انتشار 2010